Description: 用循环链表解Josephus问题。设有n个人围坐在一个圆桌周围，现从第1个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，…，如此反复直到所有的人全部出列为止。Josephus问题是：对于任意给定的n和m，求出按出列次序得到的n个人员的序列，如n=8，m=4时，输出序列是48521376。-cyclic Chain Solutions Josephus problem. N with the individuals sitting around a round table, it is from a few individuals reportedly began, a few of the m people out of ranks. Stand up and then the next person reported several fresh start, a few of the m out of the people out, ... so repeatedly until all of the people all out far out. Josephus question is : for any given set of n and m, sought out the out of order n is the sequence, if n = 8, m = 4, Sequence is 48521376. Platform: |
Size: 944 |
Author:海薇 |
Hits:
Description: 这是一个Josephus问题的C++代码,用双向链表实现.有问题题请联系ho1983xx@tom.com (2005-5-22，VC,1KB,下载0次)【向站长举报此文件和某个同类文件可能重复】-This a C++ code about Josephus problem, and use two-way chain form to realize.If you have any problem, please contact ho1983xx@tom.com Platform: |
Size: 2415 |
Author:zdw |
Hits:
Description: 数据结构中解决约瑟夫环问题的代码，里面只有源代码，大家用TC2编译一下就可以用了：）。-data structure to solve the problem of Josephus code, only the source code, we use TC2 compiler can use it with a :). Platform: |
Size: 1024 |
Author: |
Hits:
Description: Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某
个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这
个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整
数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。
例如，(7,3)Josephus 排列为3，6，2，7，5，1，4。-Josephus problem with the definition is as follows : Suppose n race who formed a ring. Given a positive integer m, from a certain section of a designated individual, along the Central Counting that every individual section m let out its out and count continue. This process continues until all the people from far out. Finally out of the winners were shown. Everyone out in the order shown in the definition of integers 1, 2, ..., n an order. With this as a (n, m), with Josephus. For example, (7,3) Josephus, were 3,6,2,7,5,1,4. Platform: |
Size: 1024 |
Author:李飞飞 |
Hits:
Description: 数据结构课程设计打包下载，包括两个1.约瑟夫环 2.最小生成树问题！！！我已经交给老师，发给大家参考一下-data structure course design package download, including two one. Josephus 2. The minimum spanning tree problem! ! ! I was handed over to the teachers, to your reference! ! Platform: |
Size: 8192 |
Author:xing |
Hits:
Description: 利用josephus问题的实现了解类及其函数的使用.了解面向对象的编程思想-Realize the use of Josephus problem understanding the use of category and function. Understanding of object-oriented programming ideas Platform: |
Size: 237568 |
Author:xieyixin |
Hits:
Description: java源代码，经典问题，约瑟夫环问题-java source code, the classic problem, the issue of Joseph Central Platform: |
Size: 10240 |
Author:zhaopengfei |
Hits:
Description: josephus问题，该问题非常经典，有助于初学者学习-josephus problem, the problem is very classic, will help beginners learn Platform: |
Size: 6144 |
Author:田威 |
Hits:
Description: 线性标的应用——Josephus问题（顺序）线性标的应用——Josephus问题（顺序)-The subject of the application of linear- Josephus problem (order of) the subject of the application of linear- Josephus problem (order Platform: |
Size: 1024 |
Author:chen |
Hits:
Description: C语言里面的经典算法，包括有老掉牙
河内塔
费式数列
巴斯卡三角形
三色棋
老鼠走迷官（一）
老鼠走迷官（二）
骑士走棋盘
八个皇后
八枚银币
生命游戏
字串核对
双色、三色河内塔
背包问题（Knapsack Problem）
数、运算
蒙地卡罗法求 PI
Eratosthenes筛选求质数
超长整数运算（大数运算）
长 PI
最大公因数、最小公倍数、因式分解
完美数
阿姆斯壮数
最大访客数
中序式转后序式（前序式）
后序式的运算
关于赌博
洗扑克牌（乱数排列）
Craps赌博游戏
约瑟夫问题（Josephus Problem）
集合问题
排列组合
格雷码（Gray Code）
产生可能的集合
m元素集合的n个元素子集
数字拆解
排序
得分排行
选择、插入、气泡排序
Shell 排序法 - 改良的插入排序
Shaker 排序法 - 改良的气泡排序
Heap 排序法 - 改良的选择排序
快速排序法（一）
快速排序法（二）
快速排序法（三）
合并排序法
基数排序法
搜寻
循序搜寻法（使用卫兵）
二分搜寻法（搜寻原则的代表）
插补搜寻法
费氏搜寻法
矩阵
稀疏矩阵
多维矩阵转一维矩阵
上三角、下三角、对称矩阵
奇数魔方阵
4N 魔方阵
2(2N+1) 魔方阵
-Obsolete
Hanoi Tower
Fei-style series
Pascal triangle
Three-color Chess
Mouse walking fans Officer (1)
Mouse walking fans Officer (2)
Knight walking board
8 Queens
8 coins
Game of Life
String matching
Two-color, three-color Hanoi Tower
Knapsack problem (Knapsack Problem)
The number of operations
Monte Carlo method seeking PI
Eratosthenes prime number screened seeking
Long integer arithmetic (operations of large numbers)
Long PI
Greatest common factor, least common multiple, factorization
Perfect Number
阿姆斯壮数
Maximum number of visitors
Type in order to switch the order of type (pre-order type)
Follow-style computing
About Gambling
Wash cards (random order)
Craps Casino Games
Joseph problems (Josephus Problem)
Set problem
Permutations
Gray code (Gray Code)
Generate the set of possible
m elements of the collection a subset of n elements
Digital dismantling
Sort
Score Ranking
Selection, insertion, bubble sort
Shell Platform: |
Size: 441344 |
Author:neoleo |
Hits:
Description: Josephus问题：一群小孩围成一圈，任意假定一个数m，从第一个小孩起，顺时针方向数，每数到第m个小孩是，该小孩便离开。小孩不断离开，圈子不断缩小。最后，剩下的一个小孩便是胜利者。究竟胜利的是第几个小孩呢？
提示：用循环链表解答，编写程序link.h实现循环的链表类，由插入与删除等基本操作。
-Josephus problem: a group of kids form a circle, any assumption that a number of m, starting from the first child, the number of clockwise direction, each number to the first m a child is the child and then left. Children continue to leave the circle shrinks. Finally, the remaining child is a winner. What victory is the first of several children feel? Tip: The circular list answers to achieve the cycle of programming link.h list class, from basic operations such as insertions and deletions. Platform: |
Size: 1024 |
Author:月月 |
Hits:
Description: 问题描述：
新Josephus排列问题定义如下：假设n个人排成一个环形，给定一个正整数m，从第1
个人开始，沿环计数，每遇到第m个人就让其出列，这时计算器m自动加一，且计数继续进
行下去。这个过程一直进行到所有的人都出列为止，最后出列者为赢家。设这n个人的编号
分别为1～n，每次从编号为1的竞赛者开始计数，那么每个人出列的次序定义为整数1～n
的一个排列。这个排列称为一个(n,m)Josephus排列。
例如，(7,3)Josephus 排列为3，7，6，2，4，1，5。
对于给定的1，2，…，n中的k个数，Josephus想知道是否存在一个正整数m使得
(n,m)Josephus排列的前k个数恰为事先指定的这k个数。
编程任务：
(1)用抽象数据类型表设计一个求(n,m)Josephus排列的算法。
(2)试设计一个算法，对于给定的正整数n和1，2，…，n中的k个数。求正整数m，使
(n,m)Josephus排列的前k个数恰为事先指定的这k个数(顺序必须完全一样)。
-Problem Description:
Josephus ordered a new problem definition is as follows: Suppose n individuals arranged in a ring, given a positive integer m, from the first one
Begins with individuals along the ring count, when confronted with the first m individuals let their out of line, then automatically add a calculator m, and the count continued into the
OK go on. This process continues until all of them out of the column until the last person out of the column as a winner. This set up the individual numbers n
Respectively, 1 ~ n, each number is one from the race have begun to count, then the order of each person out of the column is defined as an integer 1 ~ n
An array. This arrangement is called a (n, m) Josephus arranged.
For example, (7,3) Josephus arranged as 3,7,6,2,4,1,5.
For a given 1,2, ..., n in the k-number, Josephus would like to know whether there is a positive integer m makes the
(n, m) Josephus arranged in exactly the number of pre-k this for a pre-specified k number Platform: |
Size: 2048 |
Author:atlantis |
Hits:
Description: 此代码能够利用循环链表解决约瑟夫问题并且为c++代码-This code can solve the Josephus problem using circular linked list and for the c++ code Platform: |
Size: 1024 |
Author:李万彬 |
Hits:
Description: 约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的顺序是：5，4，6，2，3，1。-The Josephus problem is the following game: N people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After M passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. Thus, if M=0, and N=5, players are eliminated in order, and player 5 wins. If M=1, and N=5, the order of eliminated is 2, 4, 1, 5.
Write a program to solve the Josephus problem for general values of M and N. Try to make your program as efficient as possible. Make sure you dispose of cells. Platform: |
Size: 1024 |
Author:陈天睿 |
Hits:
Description: 通过c语言数组算法解决josephus问题，m个人围成一圈，从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开，最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory) Platform: |
Size: 4096 |
Author:靇笙
|
Hits:
Search - Josephus problem